/*
 *  POJ2362: Square
 */

/*-------- Includes --------*/
#include <iostream>
#include <algorithm>

using namespace std;

/*-------- Types --------*/

/*-------- Global Variables --------*/
int  nStick;
int  slen;
int  sticks[32];
bool isUsed[32];

/*-------- Function Prototypes --------*/
bool compar(int a, int b);
bool dfs(int ptr, int len, int depth);

/*-------- Main Function --------*/
int main(int argc, char const *argv[])
{
    int nCase;

    cin >> nCase;

    while (nCase--) {
        cin >> nStick;

        // get input
        for (int i = 0; i < nStick; i++) {
            cin >> sticks[i];
            isUsed[i] = false;
        }

        // sort in descending order
        sort(sticks, sticks + nStick, compar);

        int sum = 0;

        for (int i = 0; i < nStick; i++) sum += sticks[i];

        slen = sum / 4;

        // cut off 1
        if (sum % 4 != 0 || sticks[0] > slen) {
            cout << "no" << endl;
            continue;
        }

        if (dfs(0, slen, 0)) cout << "yes" << endl;
        else                 cout << "no" << endl;
    }

    return 0;
}

/*-------- Functions --------*/
bool compar(int a, int b)
{
    return a > b;
}

bool dfs(int ptr, int len, int depth)
{
    // current stick is complete
    if (len == 0) {
        // base case: reach the bottom
        if (depth == nStick) return true;

        // udpate ptr and len for new stick
        ptr = 0;
        while (isUsed[ptr]) ptr++;

        len = slen;
    }

    // current stick is incomplete
    int lastStick = -1;
    for (int i = ptr; i < nStick; i++) {
        // cut off 2: if current stick has same length as last, then skip
        if (isUsed[i] || sticks[i] > len || sticks[i] == lastStick) continue;

        isUsed[i] = true;

        if (dfs(i + 1, len - sticks[i], depth + 1))
            return true;

        // revert for backtracing
        isUsed[i] = false;

        // cut off 3: for new stick, if first stick is failed, then skip
        if (len == slen) break;

        lastStick = sticks[i];
    }

    return false;
}
